Computational Stochastic Control: Basic Foundations, Complexity and Techniques

نویسنده

  • Floyd B. Hanson
چکیده

Much research and education in control systems is purely mathematical, but computational advances in stochastic control problem solving can be used beyond the limits of theoretical mathematics. Theoretical and computational mathematics are complementary. Computation is important where the problem is mathematically intractable, highly dimensional as in stochastic dynamic programming or urgently in need of answers as in competitive financial predictions. Many advances in solving large scale control problems have been gained through technical improvements in computing hardware, but as many advances have been made in the development of better algorithms. Both analysis and computation are important in solving problems. Both rely on mathematics, but rely on them in different ways. An important part of educational training is general preparation for problem solving since postgraduate jobs are uncertain in the current world. In this expository control education paper, some basic computational considerations, high performance computers and useful algorithms are surveyed. Much of the knowledge gained in research has been transferred to classes in computation and control, so that student instruction is at the leading edge, a buffer against obsolescence. An important general lesson in computational education is that the computation forms the other half of mathematics, beyond regular mathematics courses. Computation has its own algebra, oriented to finite precision arithmetic, and its own numerically oriented analysis. The view is that of an applied analyst and computational control scientist explaining the field to those with a regular mathematics background.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-stage stochastic programming model for capacitated complete star p-hub network with different fare classes of customers

In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...

متن کامل

Constrained Robust Optimal Trajectory Tracking: Model Predictive Control Approaches

This thesis is concerned with the theoretical foundations of Robust Model Predictive Control and its application to tracking control problems. Its first part provides an introduction to MPC for constrained linear systems as well as a survey of different Robust MPC methodologies. The second part consists of a discussion of the recently developed Tube-Based Robust MPC framework and its extension ...

متن کامل

Mathematical foundations of modern cryptography: computational complexity perspective

Theoretical computer science has found fertile ground in many areas of mathematics. The approach has been to consider classical problems through the prism of computational complexity, where the number of basic computational steps taken to solve a problem is the crucial qualitative parameter. This new approach has led to a sequence of advances, in setting and solving new mathematical challenges ...

متن کامل

08w5094 Analytic Tools in Computational Complexity

Computational Complexity Theory is the field that studies the inherent costs of algorithms for solving mathematical problems. Its major goal is to identify the limits of what is efficiently computable in natural computational models. Computational complexity ranges from quantum computing to determining the minimum size of circuits that compute basic mathematical functions to the foundations of ...

متن کامل

Computational Complexity (10w5028)

Computational Complexity Theory is the field that studies the inherent costs of algorithms for solving mathematical problems. Its major goal is to identify the limits of what is efficiently computable in natural computational models. Computational complexity ranges from quantum computing to determining the minimum size of circuits that compute basic mathematical functions to the foundations of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003